1514B - AND 0 Sum Big - CodeForces Solution

 #include <bits/stdc++.h>
 using namespace std;
 #define int long long
 #define pi (3.141592653589)
 #define mod 1000000007
 #define float double
 #define pb push_back
 #define mp make_pair
 #define ff first
 #define ss second
 #define endl '\n'
 #define all(c) c.begin(), c.end()
 #define min3(a, b, c) min(c, min(a, b))
 #define min4(a, b, c, d) min(d, min(c, min(a, b)))
 #define max3(a, b, c) max(c, max(a, b))
 #define max4(a, b, c, d) max(d, max(c, max(a, b)))
 #define rrep(i, n) for(int i=n-1;i>=0;i--)
 #define rep(i,n) for(int i=0;i<n;i++)
 #define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 const int m=1e9+7;
  
 int power(int a,int b){
   if(b==0) return 1;
   return (b&1) ? ((a*power(a,b/2))%m*(power(a,b/2))%m%m) : ((power(a,b/2)%m)*(power(a,b/2))%m)%m;
 }
 
 bool isPrime(int n){
   if(n==1) return false;
   if(n==2) return true;
   for(int i=2;i*i<=n;i++){
      if(n%i==0)return false;
   }
   return true;
 }
 
 void solve(){
   int n,k,count=0;
   cin>>n>>k;
    cout<<power(n,k)%m<<endl;
    

   }
   

 int32_t main(){
 fast
 
 
 
 
 int t=1;
 cin>>t;
 while(t--){
     solve();
 }
 return 0;
 }